SEGRoute: A New Global Routing Methodology Based on Grid Graph Segmentation

In this paper, we propose a new global routing methodology named SEGRoute, which is based on grid graph segmentation of the given routing problem. The SEGRouting methodology first divides the grid graph of the routing problem into various segments; it then performs routing for the various segments (completing routing if possible and trying to maintain minimum wirelength) and then performs a “segment congestion-driven” Steiner tree construction for fast construction of Steiner trees and to eliminate routing congestion. We also propose an algorithm for efficient grid segmentation and methodologies for “segmentbased” global routing. Our experimental results show that SEGRoute produces better wirelength solutions and comparable congestion solutions in up to 96x and 57x faster runtimes than the state-of-the-art published global routers, Labyrinth 1.1 [1] [13] and Fengshui 5.1 [2] (the newest implementation of the Chi dispersion router).